Modules program structures and the structuring of operating systems

In this paper some views are presented on the way in which complex systems, such as Operating Systems and the programs to be interfaced with them can be constructed, and how such systems may become heavily library oriented. Although such systems have a dynamic nature, all interfacing within and among modules can be checked statically. It will be shown that the concepts presented are equally valid for single user systems, multi-programming systems and even distributed systems. The ideas have been spurred by the implementation of a modular version of Pascal and a supporting Operating System, currently nearing completion at Twente University of Technology, The Netherlands

Exploring the SDSS Dataset with Linked Scatter Plots: I. EMP, CEMP, and CV Stars

We present the results of a search for extremely metal-poor (EMP), carbon-enhanced metal-poor (CEMP), and cataclysmic variable (CV) stars using a new exploration tool based on linked scatter plots (LSPs). Our approach is especially designed to work with very large spectrum data sets such as the SDSS, LAMOST, RAVE, and Gaia data sets, and it can be applied to stellar, galaxy, and quasar spectra. As a demonstration, we conduct our search using the SDSS DR10 data set. We first created a 3326-dimensional phase space containing nearly 2 billion measures of the strengths of over 1600 spectral features in 569,738 SDSS stars. These measures capture essentially all the stellar atomic and molecular species visible at the resolution of SDSS spectra. We show how LSPs can be used to quickly isolate and examine interesting portions of this phase space. To illustrate, we use LSPs coupled with cuts in selected portions of phase space to extract EMP stars, CEMP stars, and CV stars. We present identifications for 59 previously unrecognized candidate EMP stars and 11 previously unrecognized candidate CEMP stars. We also call attention to 2 candidate He~II emission CV stars found by the LSP approach that have not yet been discussed in the literature.Comment: Accepted by the Astrophysical Journal Supplement (February 2017

Identification of the plasma membrane receptor for interleukin-1 on mouse thymoma cells

AbstractThe plasma membrane receptor for interleukin-1 (IL-1) has been characterized from mouse EL4-6.1 thymoma cells. Following binding of IL-1 to surface labeled EL4-6.1 cells, the IL-1 binding molecule was immunoprecipitated using a rabbit antiserum against the hormone. The putative IL-1 receptor is a membrane-associated glycopeptide of Mr = 82000 containing probably two or three N-linked glycan units as indicated by its conversion into a Mr = 60 000 polypeptide upon deglycosylation with endo-β-N-glycosidase F

The Simplicial Characterisation of TS networks: Theory and applications

We use the visibility algorithm to construct the time series networks obtained from the time series of different dynamical regimes of the logistic map. We define the simplicial characterisers of networks which can analyse the simplicial structure at both the global and local levels. These characterisers are used to analyse the TS networks obtained in different dynamical regimes of the logisitic map. It is seen that the simplicial characterisers are able to distinguish between distinct dynamical regimes. We also apply the simplicial characterisers to time series networks constructed from fMRI data, where the preliminary results indicate that the characterisers are able to differentiate between distinct TS networks.Comment: 11 pages, 2 figures, 4 tables. Accepted for publication in Proceedings of the 4th International Conference on Applications in Nonlinear Dynamics (ICAND 2016

A pascal compiler for PDP 11 minicomputers

In this paper the development of a cross-compiler running on the central computing facility is described. The compiler transforms PASCAL source code into object code for the PDP 11 family. The arguments for higher level languages on minicomputers and the choice made for PASCAL are discussed. It is shown that only a minor effort in terms of manpower is required if such a development is based on an existing compiler that is suited to the purpose of adaptation. Even without large amounts of optimization the code produced is both compact and efficient. Some attention is paid to requirements that should be fulfilled in portable compilers. The paper ends with a discussion of some strong points and weak points of the PDP 11 architecture

Accuracy of computerized tomography in determining hepatic tumor size in patients receiving liver transplantation or resection

Computerized tomography (CT) of liver is used in oncologic practice for staging tumors, evaluating response to treatment, and screening patients for hepatic resection. Because of the impact of CT liver scan on major treatment decisions, it is important to assess its accuracy. Patients undergoing liver transplantation or resection provide a unique opportunity to test the accuracy of hepatic-imaging techniques by comparison of finding of preoperative CT scan with those at gross pathologic examination of resected specimens. Forty-one patients who had partial hepatic resection (34 patients) or liver transplantation (eight patients) for malignant (30 patients) or benign (11 patients) tumors were evaluable. Eight (47%) of 17 patients with primary malignant liver tumors, four (31%) of 13 patients with metastatic liver tumors, and two (20%) of 10 patients with benign liver tumors had tumor nodules in resected specimens that were not apparent on preoperative CT studies. These nodules varied in size from 0.1 to 1.6 cm. While 11 of 14 of these nodules were 1.0 cm. These results suggest that conventional CT alone may be insufficient to accurately determine the presence or absence of liver metastases, extent of liver involvement, or response of hepatic metastases to treatment

A Computational Comparison of Optimization Methods for the Golomb Ruler Problem

The Golomb ruler problem is defined as follows: Given a positive integer n, locate n marks on a ruler such that the distance between any two distinct pair of marks are different from each other and the total length of the ruler is minimized. The Golomb ruler problem has applications in information theory, astronomy and communications, and it can be seen as a challenge for combinatorial optimization algorithms. Although constructing high quality rulers is well-studied, proving optimality is a far more challenging task. In this paper, we provide a computational comparison of different optimization paradigms, each using a different model (linear integer, constraint programming and quadratic integer) to certify that a given Golomb ruler is optimal. We propose several enhancements to improve the computational performance of each method by exploring bound tightening, valid inequalities, cutting planes and branching strategies. We conclude that a certain quadratic integer programming model solved through a Benders decomposition and strengthened by two types of valid inequalities performs the best in terms of solution time for small-sized Golomb ruler problem instances. On the other hand, a constraint programming model improved by range reduction and a particular branching strategy could have more potential to solve larger size instances due to its promising parallelization features